On the complexity of the economic lot-sizing problem with remanufacturing options
نویسنده
چکیده
In this paper we investigate the complexity of the economic lot-sizing problem with remanufacturing (ELSR) options. Whereas in the classical economic lot-sizing problem demand can only be satisfied by production, in the ELSR problem demand can also be satisfied by remanufacturing returned items. Although the ELSR problem can be solved efficiently for some special cases, we show that the problem is NP-hard in general, even under stationary cost parameters.
منابع مشابه
Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملCost Sharing for the Economic Lot-Sizing Problem with Remanufacturing Options
We consider a new class of cooperative cost sharing games, associated with the economic lot-sizing problem with remanufacturing options (ELSR). As a preliminary step, we investigate the relative strength and integrality gaps of various mathematical optimization formulations of ELSR. Using insights from these results, we study the core of the associated cost sharing game. We show that the cost s...
متن کاملOPTIMAL LOT-SIZING DECISIONS WITH INTEGRATED PURCHASING, MANUFACTURING AND ASSEMBLING FOR REMANUFACTURING SYSTEMS
This work applies fuzzy sets to the integration of purchasing, manufacturing and assembling of production planning decisions with multiple suppliers, multiple components and multiple machines in remanufacturing systems. The developed fuzzy multi-objective linear programming model (FMOLP) simultaneously minimizes total costs, total $text{CO}_2$ emissions and total lead time with reference to cus...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملEconomic lot-sizing with remanufacturing: complexity and efficient formulations
Within the framework of reverse logistics, the classic economic lot-sizing problem has been extended with a remanufacturing option. In this extended problem, known quantities of used products are returned from customers in each period. These returned products can be remanufactured, so that they are as good as new. Customer demand can then be fulfilled both from newly produced and remanufactured...
متن کامل